Efficient lock-free durable sets
نویسندگان
چکیده
منابع مشابه
Efficient Lock Free Privatization
Working on shared mutable data requires synchronization through barriers, locks or transactional memory mechanisms. To avoid this overhead a thread may privatize part of the data and work on it locally. By privatizing a data item a thread is guaranteed that it is the only one accessing this data, i.e., that it accesses the data item in exclusion. The most robust and yet lock-free privatization ...
متن کاملDurable Products, Time Inconsistency, and Lock-in
M durable products cannot be used without a contingent consumable product, e.g., printers require ink, iPods require songs, razors require blades, etc. For such products, manufacturers may be able to lock in consumers by making their products incompatible with consumables that are produced by other firms. We examine the effectiveness of such a strategy in the presence of strategic consumers who...
متن کاملDuraNet: Energy-Efficient Durable Slot-Free Power Scheduling
Class project submission for CS262A. Please do not cite or distribute beyond NEST. Contact the authors for the latest version. We present an effective distributed power scheduling algorithm for fixed, low bandwidth, many to one data collection sensor network applications. DuraNet reduces energy consumption by avoiding collision and overhearing while having nodes sleep most of the time. Because ...
متن کاملTechniques for Constructing Efficient Lock-free Data Structures
Techniques for Constructing Efficient Lock-free Data Structures Trevor Brown Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2017 Building a library of concurrent data structures is an essential way to simplify the difficult task of developing concurrent software. Lock-free data structures, in which processes can help one another to complete operations, offer ...
متن کاملLock-free Serializable Transactions
Software transactional memory (STM) provides access to shared data with transactional properties. Existing STM use linearizability as their correctness criterion, although serializability allows more freedom in reordering the operations of committable transactions. Serializable transactions thus provide for more concurrency than linearizable transactions. Specifically, serializability allows re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on Programming Languages
سال: 2019
ISSN: 2475-1421
DOI: 10.1145/3360554